Detecting Cliques Using Degree and Connectivity Constraints
نویسندگان
چکیده
منابع مشابه
Average-case complexity of detecting cliques
The computational problem of testing whether a graph contains a complete subgraph of size k is among the most fundamental problems studied in theoretical computer science. This thesis is concerned with proving lower bounds for k-CLIQUE, as this problem is known. Our results show that, in certain models of computation, solving k-CLIQUE in the average case requires Q(nk/4) resources (moreover, k/...
متن کاملReliably Detecting Connectivity Using Local Graph Traits
Local distributed algorithms can only gather sufficient information to identify local graph traits, that is, properties that hold within the local neighborhood of each node. However, it is frequently the case that global graph properties (connectivity, diameter, girth, etc) have a large influence on the execution of a distributed algorithm. This paper studies local graph traits and their relati...
متن کاملDetecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between our formulation with a new algebraic tool, namely Radon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Practical approximation al...
متن کاملCliques in Graphs With Bounded Minimum Degree
Let fr(n, e) be the minimum number of r-cliques in graphs of order n and size e. Determining fr(n, e) has been a long-studied problem. The case r = 3, that is, counting triangles, has been studied by various people. Erdős [3], Lovász and Simonovits [7] studied the case when e = ( n 2 ) /2 + l with 0 < l n/2. Fisher [4] considered the situation when ( n 2 ) /2 e 2 ( n 2 ) /3, but it was not unti...
متن کاملDetecting Specular Reflections Using Lambertian Constraints
Specularities-bright image regions formed by specular reflection-are likely to be mistaken for genuine surface markings by processes that perform photometric analysis, derive motion fields from optical flow or est imate depth from binocular stereo. In addition th ey can be used to infer surface geometry. This paper describes a scheme for detecting specularities based on a characterisation of La...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Mining & Knowledge Management Process
سال: 2012
ISSN: 2231-007X
DOI: 10.5121/ijdkp.2012.2204